On the Classification of Type Ii Codes of Length 24 Noam D. Elkies and Scott D. Kominers

نویسندگان

  • NOAM D. ELKIES
  • SCOTT D. KOMINERS
چکیده

We give a new, purely coding-theoretic proof of Koch’s criterion on the tetrad systems of Type II codes of length 24 using the theory of harmonic weight enumerators. This approach is inspired by Venkov’s approach to the classification of the root systems of Type II lattices in R, and gives a new instance of the analogy between lattices and codes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Classification of Type II Codes of Length 24

We give a new, purely coding-theoretic proof of Koch’s criterion on the tetrad systems of Type II codes of length 24 using the theory of harmonic weight enumerators. This approach is inspired by Venkov’s approach to the classification of the root systems of Type II lattices in R, and gives a new instance of the analogy between lattices and codes.

متن کامل

Still better nonlinear codes from modular curves

We give a new construction of nonlinear error-correcting codes over suitable finite fields k from the geometry of modular curves with many rational points over k, combining two recent improvements on Goppa’s construction. The resulting codes are asymptotically the best currently known.

متن کامل

Weighted Generating Functions and Configuration Results for Type II Lattices and Codes

We present an exposition of weighted theta functions, which are weighted generating functions for the norms and distribution of lattice vectors. We derive a decomposition theorem for the space of degree-d homogeneous polynomials in terms of spaces of harmonic polynomials and then prove that the weighted theta functions of Type II lattices are examples of modular forms. Our development of these ...

متن کامل

Optimal Linear Codes Over GF(7) and GF(11) with Dimension 3

Let $n_q(k,d)$ denote the smallest value of $n$ for which there exists a linear $[n,k,d]$-code over the Galois field $GF(q)$. An $[n,k,d]$-code whose length is equal to $n_q(k,d)$ is called {em optimal}. In this paper we present some matrix generators for the family of optimal $[n,3,d]$ codes over $GF(7)$ and $GF(11)$. Most of our given codes in $GF(7)$ are non-isomorphic with the codes pre...

متن کامل

Modular forms and K3 surfaces

For every known Hecke eigenform of weight 3 with rational eigenvalues we exhibit a K3 surface over Q associated to the form. This answers a question asked independently by Mazur and van Straten. The proof builds on a classification of CM forms by the second author.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009